An Empirical Investigation of Brute Force to choose Features, Smoothers and Function Approximators

نویسندگان

  • Andrew W. Moore
  • Daniel J. Hill
  • Michael P. Johnson
چکیده

The generalization error of a function approximator, feature set or smoother can be estimated directly by the leave-one-out cross-validation error. For memory-based methods, this is computationally feasible. We describe an initial version of a general memory-based learning system (GMBL): a large collection of learners brought into a widely applicable machine-learning family. We present ongoing investigations into search algorithms which, given a dataset, nd the family members and features that generalize best. We also describe GMBL's application to two noisy, di cult problems|predicting car engine emissions from pressure waves, and controlling a robot billiards player with redundant state variables.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Performance Survey of Meta-Heuristic And Brute-Force Search Algorithms to Cryptanalysis The SDES Encryption Algorithm

For many years, cryptanalysis has been considered as an attractive topic in jeopardizing the security and resistance of an encryption algorithm. The SDES encryption algorithm is a symmetric cryptography algorithm that performs a cryptographic operation using a crypt key. In the world of encryption, there are many search algorithms to cryptanalysis. In these researches, brute force attack algori...

متن کامل

An Empirical Investigation of Brute Force tochoose

The generalization error of a function approximator, feature set or smoother can be estimated directly by the leave-one-out cross-validation error. For memory-based methods, this is computationally feasible. We describe an initial version of a general memory-based learning system (GMBL): a large collection of learners brought into a widely applicable machine-learning family. We present ongoing ...

متن کامل

Investigation for an Approach to Optimise the Structure of Human Force

Abstract This paper proposes an approach to find an optimum structure for educational levels of human forces. To this end, a Linear Programming (LP) Model integrated with a Social Accounting Matrix (SAM) was employed. The integrated model was employed using the SAM of Golestan Province of Iran. It was demonstrated that when unemployment is the result of inconsistency between supply and demand...

متن کامل

Privacy Aware Feature Selection: An Application to Protecting Motion Data

Advances in machine learning provide the ability to predict personal data from seemingly unrelated sources. We focus on privacy leaks from providing motion data from a smartphone and seek to understand the risk to personal privacy. We collect a data set containing 74 statistical features from various motion sensors continuously collected from 88 subjects providing over 40 hours of data. An idea...

متن کامل

Variance Penalizing AdaBoost

This paper proposes a novel boosting algorithm called VadaBoost which is motivated by recent empirical Bernstein bounds. VadaBoost iteratively minimizes a cost function that balances the sample mean and the sample variance of the exponential loss. Each step of the proposed algorithm minimizes the cost efficiently by providing weighted data to a weak learner rather than requiring a brute force e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1992